#include <iostream>
#include <fstream>
using namespace std;
int d[500];
int main() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
int m[12] = {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334};
int n, mt, day, t, p;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> mt >> day >> p >> t;
mt = 100 + m[mt - 1] + day;
for (int j = mt - t; j < mt; ++j) {
d[j] += p;
}
}
mt = 0;
for (int i = 0; i < 500; ++i) {
if (d[i] > mt) {
mt = d[i];
}
}
cout << mt;
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |